An Artin relation of length n in the braid groupSERVATIUS, H.Discrete mathematics. 1992, Vol 104, Num 2, pp 185-189, issn 0012-365XArticle

Equivalence between the maximum covering problem and the maximum matching problemPLESNIK, J.Discrete mathematics. 1984, Vol 49, Num 3, pp 315-317, issn 0012-365XArticle

On rectilinear duals for vertex-weighted plane graphsDE BERG, Mark; MUMFORD, Elena; SPECKMANN, Bettina et al.Lecture notes in computer science. 2006, Vol 3843, pp 61-72, issn 0302-9743, isbn 3-540-31425-3, 1Vol, 12 p.Conference Paper

STRUCTURE AND STABILITY IN WEIGHTED DIGRAPH MODELSROBERTS FS.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979; VOL. 321; PP. 64-77; BIBL. 29 REF.Article

UNE CARACTERISATION DES COUPLAGES DE POIDS MAXIMAL ET DE CARDINALITE FIXEE DANS LES GRAPHES PONDERES FINIS.MINOUX M.1976; C.R. ACAD. SCI., A; FR.; DA. 1976; VOL. 282; NO 7; PP. 353-354; ABS. ANGL.; BIBL. 3 REF.Article

A BRANCH-AND-BOUND ALGORITHM FOR PAGINATION.DUNCAN J; SCOTT LW.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 2; PP. 240-259; BIBL. 10 REF.Article

Weighted domination in triangle-free graphsDANKELMANN, Peter; RAUTENBACH, Dieter; VOLKMANN, Lutz et al.Discrete mathematics. 2002, Vol 250, Num 1-3, pp 233-239, issn 0012-365XArticle

Parametric problems on graphs of bounded tree-widthFERNANDEZ-BACA, D; SLUTZKI, G.Journal of algorithms (Print). 1994, Vol 16, Num 3, pp 408-430, issn 0196-6774Article

A PARALLEL ALGORITHM FOR CONSTRUCTING MINIMUM SPANNING TREESBENTLEY JL.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL AND COMPUTING. 17/1979/MONTICELLO IL; USA; URBANA-CHAMPAIGN: UNIVERSITY OF ILLINOIS; DA. S.D.; PP. 11-20; BIBL. 12 REF.Conference Paper

SOLUTIONS ENTIERES ET SOLUTIONS CONTINUES DES PROBLEMES DE COUPLAGES DANS LES GRAPHES PONDERES FINISMINOUX M.1980; C. R. HEBD. SEANCES ACAD. SCI., SER. A; ISSN 0302-8429; FRA; DA. 1980; VOL. 291; NO 5; PP. 363-364; ABS. ENG; BIBL. 8 REF.Article

Efficient algorithms for the weighted 2-center problem in a cactus graphBEN-MOSHE, Boaz; BHATTACHARYA, Binay; QIAOSHENG SHI et al.Lecture notes in computer science. 2005, pp 693-703, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 11 p.Conference Paper

On clustering using random walksHAREL, David; KOREN, Yehuda.Lecture notes in computer science. 2001, pp 18-41, issn 0302-9743, isbn 3-540-43002-4Conference Paper

1-Approximation algorithm for bottleneck disjoint path matchingDATTA, A. K; SEN, R. K.Information processing letters. 1995, Vol 55, Num 1, pp 41-44, issn 0020-0190Article

Proximity Graphs Inside Large Weighted GraphsABREGO, Bernardo M; FABILA-MONROY, Ruy; FERNANDEZ-MERCHANT, Silvia et al.Networks (New York, NY). 2013, Vol 61, Num 1, pp 29-39, issn 0028-3045, 11 p.Article

A Neuro-Evolutionary Corpus-Based Method for Word Sense DisambiguationAZZINI, Antonia; DA COSTA PEREIRA, Célia; DRAGONI, Mauro et al.IEEE intelligent systems. 2012, Vol 27, Num 6, pp 26-35, issn 1541-1672, 10 p.Article

On the hardness of embeddings between two finite metricsCARY, Matthew; RUDRA, Atri; SABHARWAL, Ashish et al.Lecture notes in computer science. 2005, pp 1412-1423, issn 0302-9743, isbn 3-540-27580-0, 12 p.Conference Paper

All-pairs shortest paths with real weights in O(n³/logn) timeCHAN, Timothy M.Lecture notes in computer science. 2005, pp 318-324, issn 0302-9743, isbn 3-540-28101-0, 7 p.Conference Paper

A series of search designs for 2^m factorial designs of resolution V which permit search of one or two unknown extra three-factor interactionsSHIRAKURA, T; TAZAWA, S.Annals of the Institute of Statistical Mathematics. 1992, Vol 44, Num 1, pp 185-196, issn 0020-3157Article

Combinatorial structures associated with Lie algebras of finite dimensionCARRIAZO, A; FERNANDEZ, L. M; NUNEZ, J et al.Linear algebra and its applications. 2004, Vol 389, pp 43-61, issn 0024-3795, 19 p.Article

A novel neural network approach to solve exact and inexact graph isomorphism problemsJAIN, Brijnesh J; WYSOTZKI, Fritz.Lecture notes in computer science. 2003, pp 299-306, issn 0302-9743, isbn 3-540-40408-2, 8 p.Conference Paper

Using bipartite and multidimensional matching to select the roots of a system of polynomial equationsBEKKER, H; BRAAD, E. P; GOLDENGORIN, B et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25860-4, 4Vol, part IV, 397-406Conference Paper

Efficient algorithms for the longest path problemUEHARA, Ryuhei; UNO, Yushi.Lecture notes in computer science. 2004, pp 871-883, issn 0302-9743, isbn 3-540-24131-0, 13 p.Conference Paper

A linear algorithm for finding the invariant edges of an edge-weighted graphMALVESTUTO, F. M; MEZZINI, M.SIAM journal on computing (Print). 2002, Vol 31, Num 5, pp 1438-1455, issn 0097-5397, 18 p.Article

A faster all-pairs shortest path algorithm for real-weighted sparse graphsPETTIE, Seth.Lecture notes in computer science. 2002, pp 85-97, issn 0302-9743, isbn 3-540-43864-5, 13 p.Conference Paper

On component-size bounded Steiner treesDING-ZHU DU.Discrete applied mathematics. 1995, Vol 60, Num 1-3, pp 131-140, issn 0166-218XArticle